Game chromatic number of Cartesian and corona product graphs
نویسندگان
چکیده
منابع مشابه
Game Chromatic Number of Cartesian Product Graphs
The game chromatic number χg is considered for the Cartesian product G 2 H of two graphs G and H. We determine exact values of χg(G2H) when G and H belong to certain classes of graphs, and show that, in general, the game chromatic number χg(G2H) is not bounded from above by a function of game chromatic numbers of graphs G and H. An analogous result is proved for the game coloring number colg(G2...
متن کاملK-tuple Chromatic Number of the Cartesian Product of Graphs
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known that χ(G2H) = max{χ(G), χ(H)}. In this paper, we show that there exist graphs G and H such that χk...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملChromatic Number for a Generalization of Cartesian Product Graphs
Let G be a class of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a graph from G on each of the lines parallel to one of the axes. Thus each vertex belongs to d of these subgraphs. The class of d-fold grids over G is denoted by Gd. Let f(G; d) = maxG∈Gd χ(G). If each graph in G is k-colorable, then f(G; d) ≤ kd. We show that this b...
متن کاملThe Game Chromatic Number of Some Families of Cartesian Product Graphs
We find exact values for the game chromatic number of the Cartesian product graphs Sm¤Pn, Sm¤Cn, P2¤Wn, and P2¤Km,n. This extends previous results of Bartnicki et al. on the game chromatic number of Cartesian product graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2018
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.458240